Efficient belief-state AND-OR search, with application to Kriegspiel
نویسندگان
چکیده
The paper reports on new algorithms for solving partially observable games. Whereas existing algorithms apply AND-OR search to a tree of blackbox belief states, our “incremental” versions treat uncertainty as a new search dimension, examining the physical states within a belief state to construct solution trees incrementally. On a newly created database of checkmate problems for Kriegspiel (a partially observable form of chess), incrementalization yields speedups of two or more orders of magnitude on hard instances.
منابع مشابه
Exploiting Belief State Structure in Graph Search
It is well-known that eliminating repeated states is essential for efficient search of state-space AND-OR graphs. The same technique has been found useful for searching beliefstate AND-OR graphs, which arise in nondeterministic partially observable planning problems and in partially observable games. Whereas physical states are viewed by search algorithms as atomic and admit only equality tests...
متن کاملMonte Carlo Tree Search Techniques in the Game of Kriegspiel
Monte Carlo tree search has brought significant improvements to the level of computer players in games such as Go, but so far it has not been used very extensively in games of strongly imperfect information with a dynamic board and an emphasis on risk management and decision making under uncertainty. In this paper we explore its application to the game of Kriegspiel (invisible chess), providing...
متن کاملSearching over Metapositions in Kriegspiel
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player his opponent’s moves. Although it is a two person game it needs a referee, whose task consists in accepting the legal moves and rejecting the illegal ones, with respect to the real situation. Neither player knows the w...
متن کاملMoving in the Dark: Progress through Uncertainty in Kriegspiel
Kriegspiel is a wargame based on the rules of Chess. A player only knows the position of his own pieces, while his opponent’s pieces are “in the dark”, ie. they are invisible. A Kriegspiel player has to guess the state of the game and progress to checkmate being in the dark about the history of moves (but he can exploit the messages of a referee). Thus, computer playing of Kriegspiel is difficu...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کامل